0.03/0.11 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.03/0.12 % Command : run_E %s %d THM 0.11/0.32 % Computer : n009.cluster.edu 0.11/0.32 % Model : x86_64 x86_64 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.11/0.32 % Memory : 8042.1875MB 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64 0.11/0.32 % CPULimit : 960 0.11/0.32 % WCLimit : 120 0.11/0.32 % DateTime : Tue Aug 9 06:43:20 EDT 2022 0.11/0.33 % CPUTime : 0.16/0.47 Running higher-order on 8 cores theorem proving 0.16/0.47 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=120 /export/starexec/sandbox2/benchmark/theBenchmark.p 0.16/0.47 # Version: 3.0pre003-ho 0.16/0.53 # Preprocessing class: HSLMSMSSLLLCHSA. 0.16/0.53 # Scheduled 6 strats onto 8 cores with 120 seconds (960 total) 0.16/0.53 # Starting lpo1_fix with 360s (3) cores 0.16/0.53 # Starting full_lambda_9 with 120s (1) cores 0.16/0.53 # Starting almost_fo_4 with 120s (1) cores 0.16/0.53 # Starting new_ho_9 with 120s (1) cores 0.16/0.53 # Starting pre_casc_4 with 120s (1) cores 0.16/0.53 # Starting ho_unfolding_6 with 120s (1) cores 0.16/0.53 # pre_casc_4 with pid 9870 completed with status 0 0.16/0.53 # Result found by pre_casc_4 0.16/0.53 # Preprocessing class: HSLMSMSSLLLCHSA. 0.16/0.53 # Scheduled 6 strats onto 8 cores with 120 seconds (960 total) 0.16/0.53 # Starting lpo1_fix with 360s (3) cores 0.16/0.53 # Starting full_lambda_9 with 120s (1) cores 0.16/0.53 # Starting almost_fo_4 with 120s (1) cores 0.16/0.53 # Starting new_ho_9 with 120s (1) cores 0.16/0.53 # Starting pre_casc_4 with 120s (1) cores 0.16/0.53 # SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true) 0.16/0.53 # ...ProofStateSinE()=120/398 0.16/0.53 # Search class: HGHSM-FSLM31-DHSMMSBN 0.16/0.53 # partial match(1): HGHSM-FSLM31-MHSMMSBN 0.16/0.53 # Scheduled 6 strats onto 1 cores with 120 seconds (120 total) 0.16/0.53 # Starting new_ho_10_cnf2 with 63s (1) cores 0.16/0.53 # new_ho_10_cnf2 with pid 9872 completed with status 0 0.16/0.53 # Result found by new_ho_10_cnf2 0.16/0.53 # Preprocessing class: HSLMSMSSLLLCHSA. 0.16/0.53 # Scheduled 6 strats onto 8 cores with 120 seconds (960 total) 0.16/0.53 # Starting lpo1_fix with 360s (3) cores 0.16/0.53 # Starting full_lambda_9 with 120s (1) cores 0.16/0.53 # Starting almost_fo_4 with 120s (1) cores 0.16/0.53 # Starting new_ho_9 with 120s (1) cores 0.16/0.53 # Starting pre_casc_4 with 120s (1) cores 0.16/0.53 # SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true) 0.16/0.53 # ...ProofStateSinE()=120/398 0.16/0.53 # Search class: HGHSM-FSLM31-DHSMMSBN 0.16/0.53 # partial match(1): HGHSM-FSLM31-MHSMMSBN 0.16/0.53 # Scheduled 6 strats onto 1 cores with 120 seconds (120 total) 0.16/0.53 # Starting new_ho_10_cnf2 with 63s (1) cores 0.16/0.53 # Preprocessing time : 0.004 s 0.16/0.53 # Presaturation interreduction done 0.16/0.53 0.16/0.53 # Proof found! 0.16/0.53 # SZS status Theorem 0.16/0.53 # SZS output start CNFRefutation 0.16/0.53 thf(decl_22, type, is_of: $i > ($i > $o) > $o). 0.16/0.53 thf(decl_23, type, all_of: ($i > $o) > ($i > $o) > $o). 0.16/0.53 thf(decl_24, type, eps: ($i > $o) > $i). 0.16/0.53 thf(decl_25, type, in: $i > $i > $o). 0.16/0.53 thf(decl_26, type, d_Subq: $i > $i > $o). 0.16/0.53 thf(decl_27, type, emptyset: $i). 0.16/0.53 thf(decl_28, type, union: $i > $i). 0.16/0.53 thf(decl_29, type, power: $i > $i). 0.16/0.53 thf(decl_30, type, repl: $i > ($i > $i) > $i). 0.16/0.53 thf(decl_31, type, d_Union_closed: $i > $o). 0.16/0.53 thf(decl_32, type, d_Power_closed: $i > $o). 0.16/0.53 thf(decl_33, type, d_Repl_closed: $i > $o). 0.16/0.53 thf(decl_34, type, d_ZF_closed: $i > $o). 0.16/0.53 thf(decl_35, type, univof: $i > $i). 0.16/0.53 thf(decl_36, type, if: $o > $i > $i > $i). 0.16/0.53 thf(decl_37, type, nIn: $i > $i > $o). 0.16/0.53 thf(decl_38, type, d_UPair: $i > $i > $i). 0.16/0.53 thf(decl_39, type, d_Sing: $i > $i). 0.16/0.53 thf(decl_40, type, binunion: $i > $i > $i). 0.16/0.53 thf(decl_41, type, famunion: $i > ($i > $i) > $i). 0.16/0.53 thf(decl_42, type, d_Sep: $i > ($i > $o) > $i). 0.16/0.53 thf(decl_43, type, d_ReplSep: $i > ($i > $o) > ($i > $i) > $i). 0.16/0.53 thf(decl_44, type, setminus: $i > $i > $i). 0.16/0.53 thf(decl_45, type, d_In_rec_G: ($i > ($i > $i) > $i) > $i > $i > $o). 0.16/0.53 thf(decl_46, type, d_In_rec: ($i > ($i > $i) > $i) > $i > $i). 0.16/0.53 thf(decl_47, type, ordsucc: $i > $i). 0.16/0.53 thf(decl_48, type, nat_p: $i > $o). 0.16/0.53 thf(decl_49, type, omega: $i). 0.16/0.53 thf(decl_50, type, d_Inj1: $i > $i). 0.16/0.53 thf(decl_51, type, d_Inj0: $i > $i). 0.16/0.53 thf(decl_52, type, d_Unj: $i > $i). 0.16/0.53 thf(decl_53, type, pair: $i > $i > $i). 0.16/0.53 thf(decl_54, type, proj0: $i > $i). 0.16/0.53 thf(decl_55, type, proj1: $i > $i). 0.16/0.53 thf(decl_56, type, d_Sigma: $i > ($i > $i) > $i). 0.16/0.53 thf(decl_57, type, setprod: $i > $i > $i). 0.16/0.53 thf(decl_58, type, ap: $i > $i > $i). 0.16/0.53 thf(decl_59, type, pair_p: $i > $o). 0.16/0.53 thf(decl_60, type, d_Pi: $i > ($i > $i) > $i). 0.16/0.53 thf(decl_61, type, imp: $o > $o > $o). 0.16/0.53 thf(decl_62, type, d_not: $o > $o). 0.16/0.53 thf(decl_63, type, wel: $o > $o). 0.16/0.53 thf(decl_64, type, obvious: $o). 0.16/0.53 thf(decl_65, type, l_ec: $o > $o > $o). 0.16/0.53 thf(decl_66, type, d_and: $o > $o > $o). 0.16/0.53 thf(decl_67, type, l_or: $o > $o > $o). 0.16/0.53 thf(decl_68, type, orec: $o > $o > $o). 0.16/0.53 thf(decl_69, type, l_iff: $o > $o > $o). 0.16/0.53 thf(decl_70, type, all: $i > ($i > $o) > $o). 0.16/0.53 thf(decl_71, type, non: $i > ($i > $o) > $i > $o). 0.16/0.53 thf(decl_72, type, l_some: $i > ($i > $o) > $o). 0.16/0.53 thf(decl_73, type, or3: $o > $o > $o > $o). 0.16/0.53 thf(decl_74, type, and3: $o > $o > $o > $o). 0.16/0.53 thf(decl_75, type, ec3: $o > $o > $o > $o). 0.16/0.53 thf(decl_76, type, orec3: $o > $o > $o > $o). 0.16/0.53 thf(decl_77, type, e_is: $i > $i > $i > $o). 0.16/0.53 thf(decl_78, type, amone: $i > ($i > $o) > $o). 0.16/0.53 thf(decl_79, type, one: $i > ($i > $o) > $o). 0.16/0.53 thf(decl_80, type, ind: $i > ($i > $o) > $i). 0.16/0.53 thf(decl_81, type, injective: $i > $i > $i > $o). 0.16/0.53 thf(decl_82, type, image: $i > $i > $i > $i > $o). 0.16/0.53 thf(decl_83, type, tofs: $i > $i > $i > $i > $i). 0.16/0.53 thf(decl_84, type, soft: $i > $i > $i > $i > $i). 0.16/0.53 thf(decl_85, type, inverse: $i > $i > $i > $i). 0.16/0.53 thf(decl_86, type, surjective: $i > $i > $i > $o). 0.16/0.53 thf(decl_87, type, bijective: $i > $i > $i > $o). 0.16/0.53 thf(decl_88, type, invf: $i > $i > $i > $i). 0.16/0.53 thf(decl_89, type, inj_h: $i > $i > $i > $i > $i > $i). 0.16/0.53 thf(decl_90, type, e_in: $i > ($i > $o) > $i > $i). 0.16/0.53 thf(decl_91, type, out: $i > ($i > $o) > $i > $i). 0.16/0.53 thf(decl_92, type, d_pair: $i > $i > $i > $i > $i). 0.16/0.53 thf(decl_93, type, first: $i > $i > $i > $i). 0.16/0.53 thf(decl_94, type, second: $i > $i > $i > $i). 0.16/0.53 thf(decl_95, type, prop1: $o > $i > $i > $i > $i > $o). 0.16/0.53 thf(decl_96, type, ite: $o > $i > $i > $i > $i). 0.16/0.53 thf(decl_97, type, wissel_wa: $i > $i > $i > $i > $i). 0.16/0.53 thf(decl_98, type, wissel_wb: $i > $i > $i > $i > $i). 0.16/0.53 thf(decl_99, type, wissel: $i > $i > $i > $i). 0.16/0.53 thf(decl_100, type, changef: $i > $i > $i > $i > $i > $i). 0.16/0.53 thf(decl_101, type, r_ec: $o > $o > $o). 0.16/0.53 thf(decl_102, type, esti: $i > $i > $i > $o). 0.16/0.53 thf(decl_103, type, empty: $i > $i > $o). 0.16/0.53 thf(decl_104, type, nonempty: $i > $i > $o). 0.16/0.53 thf(decl_105, type, incl: $i > $i > $i > $o). 0.16/0.53 thf(decl_106, type, st_disj: $i > $i > $i > $o). 0.16/0.53 thf(decl_107, type, nissetprop: $i > $i > $i > $i > $o). 0.16/0.53 thf(decl_108, type, unmore: $i > $i > $i > $i). 0.16/0.53 thf(decl_109, type, ecelt: $i > ($i > $i > $o) > $i > $i). 0.16/0.53 thf(decl_110, type, ecp: $i > ($i > $i > $o) > $i > $i > $o). 0.16/0.53 thf(decl_111, type, anec: $i > ($i > $i > $o) > $i > $o). 0.16/0.53 thf(decl_112, type, ect: $i > ($i > $i > $o) > $i). 0.16/0.53 thf(decl_113, type, ectset: $i > ($i > $i > $o) > $i > $i). 0.16/0.53 thf(decl_114, type, ectelt: $i > ($i > $i > $o) > $i > $i). 0.16/0.53 thf(decl_115, type, ecect: $i > ($i > $i > $o) > $i > $i). 0.16/0.53 thf(decl_116, type, fixfu: $i > ($i > $i > $o) > $i > $i > $o). 0.16/0.53 thf(decl_117, type, d_10_prop1: $i > ($i > $i > $o) > $i > $i > $i > $i > $i > $o). 0.16/0.53 thf(decl_118, type, prop2: $i > ($i > $i > $o) > $i > $i > $i > $i > $o). 0.16/0.53 thf(decl_119, type, indeq: $i > ($i > $i > $o) > $i > $i > $i > $i). 0.16/0.53 thf(decl_120, type, fixfu2: $i > ($i > $i > $o) > $i > $i > $o). 0.16/0.53 thf(decl_121, type, d_11_i: $i > ($i > $i > $o) > $i > $i > $i > $i). 0.16/0.53 thf(decl_122, type, indeq2: $i > ($i > $i > $o) > $i > $i > $i > $i > $i). 0.16/0.53 thf(decl_123, type, nat: $i). 0.16/0.53 thf(decl_124, type, n_is: $i > $i > $o). 0.16/0.53 thf(decl_125, type, nis: $i > $i > $o). 0.16/0.53 thf(decl_126, type, n_in: $i > $i > $o). 0.16/0.53 thf(decl_127, type, n_some: ($i > $o) > $o). 0.16/0.53 thf(decl_128, type, n_all: ($i > $o) > $o). 0.16/0.53 thf(decl_129, type, n_one: ($i > $o) > $o). 0.16/0.53 thf(decl_130, type, n_1: $i). 0.16/0.53 thf(decl_131, type, cond1: $i > $o). 0.16/0.53 thf(decl_132, type, cond2: $i > $o). 0.16/0.53 thf(decl_133, type, i1_s: ($i > $o) > $i). 0.16/0.53 thf(decl_134, type, d_22_prop1: $i > $o). 0.16/0.53 thf(decl_135, type, d_23_prop1: $i > $o). 0.16/0.53 thf(decl_136, type, d_24_prop1: $i > $o). 0.16/0.53 thf(decl_137, type, d_24_prop2: $i > $i > $o). 0.16/0.53 thf(decl_138, type, prop3: $i > $i > $i > $o). 0.16/0.53 thf(decl_139, type, prop4: $i > $o). 0.16/0.53 thf(decl_140, type, d_24_g: $i > $i). 0.16/0.53 thf(decl_141, type, plus: $i > $i). 0.16/0.53 thf(decl_142, type, n_pl: $i > $i > $i). 0.16/0.53 thf(decl_143, type, d_25_prop1: $i > $i > $i > $o). 0.16/0.53 thf(decl_144, type, d_26_prop1: $i > $i > $o). 0.16/0.53 thf(decl_145, type, d_27_prop1: $i > $i > $o). 0.16/0.53 thf(decl_146, type, d_28_prop1: $i > $i > $i > $o). 0.16/0.53 thf(decl_147, type, diffprop: $i > $i > $i > $o). 0.16/0.53 thf(decl_148, type, d_29_ii: $i > $i > $o). 0.16/0.53 thf(decl_149, type, iii: $i > $i > $o). 0.16/0.53 thf(decl_150, type, d_29_prop1: $i > $i > $o). 0.16/0.53 thf(decl_151, type, moreis: $i > $i > $o). 0.16/0.53 thf(decl_152, type, lessis: $i > $i > $o). 0.16/0.53 thf(decl_153, type, epred1_2: $i > $i > $o). 0.16/0.53 thf(decl_154, type, esk1_0: $i). 0.16/0.53 thf(decl_155, type, esk2_1: ($i > $o) > $i). 0.16/0.53 thf(decl_156, type, esk3_2: $i > ($i > $o) > $i). 0.16/0.53 thf(decl_157, type, esk4_2: $i > ($i > $o) > $i). 0.16/0.53 thf(decl_158, type, epred2_1: $i > $i > $o). 0.16/0.53 thf(decl_159, type, esk5_3: $i > ($i > $i) > $i > $i). 0.16/0.53 thf(decl_160, type, esk6_1: ($i > $o) > $i). 0.16/0.53 thf(decl_161, type, epred3_1: $i > $i > $o). 0.16/0.53 thf(decl_162, type, esk7_2: $i > ($i > $o) > $i). 0.16/0.53 thf(decl_163, type, esk8_1: ($i > $o) > $i). 0.16/0.53 thf(decl_164, type, esk9_2: ($i > $o) > ($i > $o) > $i). 0.16/0.53 thf(decl_165, type, epred4_2: ($i > $o) > $i > $i > $o). 0.16/0.53 thf(decl_166, type, epred5_1: $i > $i > $o). 0.16/0.53 thf(decl_167, type, esk10_1: $i > $i). 0.16/0.53 thf(decl_168, type, esk11_2: $i > ($i > $o) > $i). 0.16/0.53 thf(def_e_is, axiom, ((e_is)=(^[X1:$i, X60:$i, X61:$i]:(((X60)=(X61))))), file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax', def_e_is)). 0.16/0.53 thf(def_diffprop, axiom, ((diffprop)=(^[X1:$i, X183:$i, X4:$i]:((n_is @ X1 @ (n_pl @ X183 @ X4))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', def_diffprop)). 0.16/0.53 thf(def_n_is, axiom, ((n_is)=(^[Z0:$i, Z1:$i]:(((Z0)=(Z1))))), file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax', def_n_is)). 0.16/0.53 thf(def_d_not, axiom, ((d_not)=(^[X36:$o]:((imp @ ((X36)) @ (~($true)))))), file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax', def_d_not)). 0.16/0.53 thf(def_imp, axiom, ((imp)=(^[X34:$o, X35:$o]:(((X34)=>(X35))))), file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax', def_imp)). 0.16/0.53 thf(def_iii, axiom, ((iii)=(^[X1:$i, X185:$i]:((n_some @ (diffprop @ X185 @ X1))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', def_iii)). 0.16/0.53 thf(def_l_or, axiom, ((l_or)=(^[X42:$o]:(imp @ ((d_not @ ((X42))))))), file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax', def_l_or)). 0.16/0.53 thf(def_d_29_ii, axiom, ((d_29_ii)=(^[X1:$i, X184:$i]:((n_some @ (diffprop @ X1 @ X184))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', def_d_29_ii)). 0.16/0.53 thf(def_all_of, axiom, ((all_of)=(^[X3:$i > $o, X2:$i > $o]:(![X4:$i]:(((is_of @ X4 @ X3)=>(X2 @ X4)))))), file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax', def_all_of)). 0.16/0.53 thf(def_is_of, axiom, ((is_of)=(^[X1:$i, X2:$i > $o]:((X2 @ X1)))), file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax', def_is_of)). 0.16/0.53 thf(def_lessis, axiom, ((lessis)=(^[X1:$i, X188:$i]:((l_or @ ((iii @ X1 @ X188)) @ ((n_is @ X1 @ X188)))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', def_lessis)). 0.16/0.53 thf(def_n_some, axiom, ((n_some)=(l_some @ nat)), file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax', def_n_some)). 0.16/0.53 thf(def_moreis, axiom, ((moreis)=(^[X1:$i, X187:$i]:((l_or @ ((d_29_ii @ X1 @ X187)) @ ((n_is @ X1 @ X187)))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', def_moreis)). 0.16/0.53 thf(satz24a, conjecture, (all_of @ (^[X1:$i]:((in @ X1 @ nat))) @ (lessis @ n_1)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', satz24a)). 0.16/0.53 thf(satz24, axiom, (all_of @ (^[X1:$i]:((in @ X1 @ nat))) @ (^[X1:$i]:((moreis @ X1 @ n_1)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', satz24)). 0.16/0.53 thf(c_0_15, plain, ((e_is)=(^[Z0:$i, Z1:$i, Z2:$i]:(((Z1)=(Z2))))), inference(fof_simplification,[status(thm)],[def_e_is])). 0.16/0.53 thf(c_0_16, plain, ((diffprop)=(^[Z0:$i, Z1:$i, Z2:$i]:((((Z0)=(n_pl @ Z1 @ Z2)))))), inference(fof_simplification,[status(thm)],[def_diffprop])). 0.16/0.53 thf(c_0_17, axiom, ((n_is)=(^[Z0:$i, Z1:$i]:(((Z0)=(Z1))))), inference(apply_def,[status(thm)],[def_n_is, c_0_15])). 0.16/0.53 thf(c_0_18, plain, ((d_not)=(^[Z0:$o]:(((((Z0))=>(~($true))))))), inference(fof_simplification,[status(thm)],[def_d_not])). 0.16/0.53 thf(c_0_19, plain, ((imp)=(^[Z0:$o, Z1:$o]:(((Z0)=>(Z1))))), inference(fof_simplification,[status(thm)],[def_imp])). 0.16/0.53 thf(c_0_20, plain, ((iii)=(^[Z0:$i, Z1:$i]:((l_some @ nat @ (^[Z2:$i]:((((Z1)=(n_pl @ Z0 @ Z2))))))))), inference(fof_simplification,[status(thm)],[def_iii])). 0.16/0.53 thf(c_0_21, plain, ((diffprop)=(^[Z0:$i, Z1:$i, Z2:$i]:((((Z0)=(n_pl @ Z1 @ Z2)))))), inference(apply_def,[status(thm)],[c_0_16, c_0_17])). 0.16/0.53 thf(c_0_22, plain, ((l_or)=(^[Z0:$o, Z1:$o]:((((((((Z0)))=>(~($true)))))=>(Z1))))), inference(fof_simplification,[status(thm)],[def_l_or])). 0.16/0.53 thf(c_0_23, plain, ((d_not)=(^[Z0:$o]:(((((Z0))=>(~($true))))))), inference(apply_def,[status(thm)],[c_0_18, c_0_19])). 0.16/0.53 thf(c_0_24, plain, ((d_29_ii)=(^[Z0:$i, Z1:$i]:((l_some @ nat @ (^[Z2:$i]:((((Z0)=(n_pl @ Z1 @ Z2))))))))), inference(fof_simplification,[status(thm)],[def_d_29_ii])). 0.16/0.53 thf(c_0_25, plain, ((all_of)=(^[Z0:$i > $o, Z1:$i > $o]:(![X4:$i]:((((Z0 @ X4))=>(Z1 @ X4)))))), inference(fof_simplification,[status(thm)],[def_all_of])). 0.16/0.53 thf(c_0_26, plain, ((is_of)=(^[Z0:$i, Z1:$i > $o]:((Z1 @ Z0)))), inference(fof_simplification,[status(thm)],[def_is_of])). 0.16/0.53 thf(c_0_27, plain, ((lessis)=(^[Z0:$i, Z1:$i]:(((((((((((l_some @ nat @ (^[Z2:$i]:((((Z1)=(n_pl @ Z0 @ Z2))))))))))=>(~($true)))))=>((((Z0)=(Z1))))))))), inference(fof_simplification,[status(thm)],[def_lessis])). 0.16/0.53 thf(c_0_28, plain, ((iii)=(^[Z0:$i, Z1:$i]:((l_some @ nat @ (^[Z2:$i]:((((Z1)=(n_pl @ Z0 @ Z2))))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_20, c_0_21]), def_n_some])). 0.16/0.53 thf(c_0_29, plain, ((l_or)=(^[Z0:$o, Z1:$o]:((((((((Z0)))=>(~($true)))))=>(Z1))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_22, c_0_19]), c_0_23])). 0.16/0.53 thf(c_0_30, plain, ((moreis)=(^[Z0:$i, Z1:$i]:(((((((((((l_some @ nat @ (^[Z2:$i]:((((Z0)=(n_pl @ Z1 @ Z2))))))))))=>(~($true)))))=>((((Z0)=(Z1))))))))), inference(fof_simplification,[status(thm)],[def_moreis])). 0.16/0.53 thf(c_0_31, plain, ((d_29_ii)=(^[Z0:$i, Z1:$i]:((l_some @ nat @ (^[Z2:$i]:((((Z0)=(n_pl @ Z1 @ Z2))))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_24, c_0_21]), def_n_some])). 0.16/0.53 thf(c_0_32, plain, ((all_of)=(^[Z0:$i > $o, Z1:$i > $o]:(![X4:$i]:((((Z0 @ X4))=>(Z1 @ X4)))))), inference(apply_def,[status(thm)],[c_0_25, c_0_26])). 0.16/0.53 thf(c_0_33, plain, ((lessis)=(^[Z0:$i, Z1:$i]:(((((((((((l_some @ nat @ (^[Z2:$i]:((((Z1)=(n_pl @ Z0 @ Z2))))))))))=>(~($true)))))=>((((Z0)=(Z1))))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_27, c_0_28]), c_0_17]), c_0_29])). 0.16/0.53 thf(c_0_34, plain, ((moreis)=(^[Z0:$i, Z1:$i]:(((((((((((l_some @ nat @ (^[Z2:$i]:((((Z0)=(n_pl @ Z1 @ Z2))))))))))=>(~($true)))))=>((((Z0)=(Z1))))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_30, c_0_31]), c_0_17]), c_0_29])). 0.16/0.53 thf(c_0_35, negated_conjecture, ~(![X378:$i]:(((in @ X378 @ nat)=>(~(l_some @ nat @ (^[Z0:$i]:(((X378)=(n_pl @ n_1 @ Z0)))))=>((n_1)=(X378)))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[satz24a])]), c_0_32]), c_0_33])])). 0.16/0.53 thf(c_0_36, plain, ![X416:$i]:(((in @ X416 @ nat)=>(~(l_some @ nat @ (^[Z0:$i]:(((X416)=(n_pl @ n_1 @ Z0)))))=>((X416)=(n_1))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[satz24]), c_0_32]), c_0_34])])). 0.16/0.53 thf(c_0_37, negated_conjecture, ((in @ esk1_0 @ nat)&(~(l_some @ nat @ (^[Z0:$i]:(((esk1_0)=(n_pl @ n_1 @ Z0)))))&((n_1)!=(esk1_0)))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_35])])])). 0.16/0.53 thf(c_0_38, plain, ![X626:$i]:((~(in @ X626 @ nat)|((l_some @ nat @ (^[Z0:$i]:(((X626)=(n_pl @ n_1 @ Z0)))))|((X626)=(n_1))))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_36])])). 0.16/0.53 thf(c_0_39, negated_conjecture, ~((l_some @ nat @ (^[Z0:$i]:(((esk1_0)=(n_pl @ n_1 @ Z0)))))), inference(split_conjunct,[status(thm)],[c_0_37])). 0.16/0.53 thf(c_0_40, plain, ![X1:$i]:(((l_some @ nat @ (^[Z0:$i]:(((X1)=(n_pl @ n_1 @ Z0)))))|((X1)=(n_1))|~((in @ X1 @ nat)))), inference(split_conjunct,[status(thm)],[c_0_38])). 0.16/0.53 thf(c_0_41, negated_conjecture, (in @ esk1_0 @ nat), inference(split_conjunct,[status(thm)],[c_0_37])). 0.16/0.53 thf(c_0_42, negated_conjecture, ((n_1)!=(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_37])). 0.16/0.53 thf(c_0_43, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39, c_0_40]), c_0_41])]), c_0_42]), ['proof']). 0.16/0.53 # SZS output end CNFRefutation 0.16/0.53 # Parsed axioms : 398 0.16/0.53 # Removed by relevancy pruning/SinE : 278 0.16/0.53 # Initial clauses : 180 0.16/0.53 # Removed in clause preprocessing : 26 0.16/0.53 # Initial clauses in saturation : 154 0.16/0.53 # Processed clauses : 212 0.16/0.53 # ...of these trivial : 5 0.16/0.53 # ...subsumed : 51 0.16/0.53 # ...remaining for further processing : 156 0.16/0.53 # Other redundant clauses eliminated : 20 0.16/0.53 # Clauses deleted for lack of memory : 0 0.16/0.53 # Backward-subsumed : 0 0.16/0.53 # Backward-rewritten : 0 0.16/0.53 # Generated clauses : 41 0.16/0.53 # ...of the previous two non-redundant : 36 0.16/0.53 # ...aggressively subsumed : 0 0.16/0.53 # Contextual simplify-reflections : 0 0.16/0.53 # Paramodulations : 19 0.16/0.53 # Factorizations : 0 0.16/0.53 # NegExts : 0 0.16/0.53 # Equation resolutions : 21 0.16/0.53 # Propositional unsat checks : 0 0.16/0.53 # Propositional check models : 0 0.16/0.53 # Propositional check unsatisfiable : 0 0.16/0.53 # Propositional clauses : 0 0.16/0.53 # Propositional clauses after purity: 0 0.16/0.53 # Propositional unsat core size : 0 0.16/0.53 # Propositional preprocessing time : 0.000 0.16/0.53 # Propositional encoding time : 0.000 0.16/0.53 # Propositional solver time : 0.000 0.16/0.53 # Success case prop preproc time : 0.000 0.16/0.53 # Success case prop encoding time : 0.000 0.16/0.53 # Success case prop solver time : 0.000 0.16/0.53 # Current number of processed clauses : 37 0.16/0.53 # Positive orientable unit clauses : 15 0.16/0.53 # Positive unorientable unit clauses: 0 0.16/0.53 # Negative unit clauses : 6 0.16/0.53 # Non-unit-clauses : 16 0.16/0.53 # Current number of unprocessed clauses: 78 0.16/0.53 # ...number of literals in the above : 287 0.16/0.53 # Current number of archived formulas : 0 0.16/0.53 # Current number of archived clauses : 100 0.16/0.53 # Clause-clause subsumption calls (NU) : 3645 0.16/0.53 # Rec. Clause-clause subsumption calls : 446 0.16/0.53 # Non-unit clause-clause subsumptions : 51 0.16/0.53 # Unit Clause-clause subsumption calls : 21 0.16/0.53 # Rewrite failures with RHS unbound : 0 0.16/0.53 # BW rewrite match attempts : 0 0.16/0.53 # BW rewrite match successes : 0 0.16/0.53 # Condensation attempts : 212 0.16/0.53 # Condensation successes : 0 0.16/0.53 # Termbank termtop insertions : 47230 0.16/0.53 0.16/0.53 # ------------------------------------------------- 0.16/0.53 # User time : 0.041 s 0.16/0.53 # System time : 0.009 s 0.16/0.53 # Total time : 0.049 s 0.16/0.53 # Maximum resident set size: 4700 pages 0.16/0.54 0.16/0.54 # ------------------------------------------------- 0.16/0.54 # User time : 0.051 s 0.16/0.54 # System time : 0.011 s 0.16/0.54 # Total time : 0.062 s 0.16/0.54 # Maximum resident set size: 2388 pages 0.16/0.54 EOF